Multiprocessor Performability Analysis
نویسندگان
چکیده
Conclusions Performability models of multiprocessor systems and their evaluation are presented. Two cases in which hierarchical modeling is applied are examined. 1. Models are developed to analyze the behavior of processor arrays of various sizes in the presence of permanent, transient, intermittent, and near-coincident faults. Models can be generated for typical reconfiguration schemes that consider the failures of several types of components (detailed modeling). These models consider a survivability factor derived in terms of the physical distribution of faulty components. Capacity-based reward rates are then used to derive overall performability measures. 2. Queueing network models are solved to derive performance measures that are used as reward rates within an overall Markov failure-repair model of bus-based multiprocessor systems. Several configurations are compared in terms of their performability. In both cases, Markov models are generated using MGRE and solved using SHARPE. The analysis, particularly for case 2, is by no means exhaustive as several parameters are involved in the overall model. However, the hierarchical models shown, combined with the use of diverse tools such as MGRE & SHARPE, facilitate the analysis of large systems in various environments. The models can be fme-tuned according to specific applications and performance measures.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملPerformability Analysis of Highly Available Clusters with Break-downs and Deferred Repairs
Fault-tolerant systems with repair-upon-failure strategy can become expensive in terms of labour and time. While postponing these repairs, it is essential to keep the whole system capable to deal with user requests. For this purpose, usually, a threshold value is defined which represents the minimum number of servers the system administrator should keep operative. Highly available multiprocesso...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline-first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of se...
متن کاملPerformance Modelling of Multiprocessor System with one High Performance Server
Multiprocessor system models at present are very important and widely used in modelling transaction processing systems, communication networks, mobile networks, and flexible machine shops with groups of machines. Heterogeneous processors system with one faster main server and several identical servers are studied. In this paper reconfiguration and rebooting delays are considered to study the pe...
متن کاملPerformability Analysis Us ing Semi-Markov Reward Processes
With the increasing complexity of multiprocessor and distributed processing systems, the need to develop efficient and accurate modeling methods is evident. Fault tolerance and degradable performance of such systems has given rise to considerable interest in models for the combined evaluation of performance and reliability [l], [2]. Markov or semi-Markov reward models can be used to evaluate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004